The isomorphism problem for Higman–Thompson groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The isomorphism problem for Coxeter groups

By a recent result obtained by R. Howlett and the author considerable progress has been made towards a complete solution of the isomorphism problem for Coxeter groups. In this paper we give a survey on the isomorphism problem and explain in particular how the result mentioned above reduces it to its ‘reflection preserving’ version. Furthermore we desrcibe recent developments concerning the solu...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Defect Groups and the Isomorphism Problem

As a ring, a block may arise from more than one finite group. The resulting conjugacy issue for defect groups is important for the group ring isomorphism problem and for understanding block theory in general. There are even indirect structural consequences for finite groups, through G. Robinson’s work on the “Z-star theorem” for odd primes. A positive answer to the defect group conjugacy proble...

متن کامل

Groups, Graphs, Algorithms: The Graph Isomorphism Problem∗

Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity status in the P /NP theory: not expected to be NP-complete, yet not known to be solvable in polynomial time. Arguably, the GI problem boils down to filling the gap between symmetry and regularity, the former being defined in terms of automorphisms, the latter in terms of equations satisfied...

متن کامل

Permutation groups and the graph isomorphism problem

In this article, we discuss various algorithms for permutation group theoretic problems and study its close connection to the graph isomorphism problem. Motivated by this close connection, the last part of this article explores the group representability problem and mention some open problems that arise in this context.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2011

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2011.07.026